A ground-complete axiomatization of stateless bisimilarity over Linda
نویسندگان
چکیده
منابع مشابه
A ground-complete axiomatization of stateless bisimilarity over Linda
This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sublanguage are given. It is also shown that stateless bisimilarity coincides w...
متن کاملComplete Axiomatization for the Bisimilarity Distance on Markov Chains
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains. Our axiomatization is given in the style of a quantitative extension of equational logic recently proposed by Mardare, Panangaden, and Plotkin (LICS’16) that uses equality relations t ≡ε s indexed by rationals, expressing that “t is approximately e...
متن کاملSplit-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion, relabelling and restriction free fragment of Milner’s Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy’s...
متن کاملAxiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
متن کاملA complete axiomatization forML!1
In this paper we present a completeness theorem for the innnitary modal logic ML !1. The proof is based on the new notion of an innnitary modal consistency property. 1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2015
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.09.014